A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
نویسندگان
چکیده
منابع مشابه
A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملA GPI dynasearch neighborhood for the total weighted tardiness problem
art exact algorithms suffer from relatively poor performances. On the other hand the problem has been successfully tackled by local search heuristic algorithms where the neighborhood of a solution is usually computed by applying swap (a.k.a. pairwise interchange) operators to the working sequence. Dynasearch is a neighborhood search technique introduced by Congram et al. [1] whose main feature ...
متن کاملMinimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملA Cluster-based Evolutionary Algorithm for the Single Machine Total Weighted Tardiness-scheduling Problem
In this paper a new evolutionary algorithm is described for the single machine total weighted tardiness problem. The operation of this method can be divided in three stages: a cluster forming and two local search stages. In the first stage it approaches some locally optimal solutions by grouping based on similarity. In the second stage it improves the accuracy of the approximation of the soluti...
متن کاملA Genetic Algorithm for Single Machine Total Weighted Tardiness Scheduling Problem
This paper presents a new genetic algorithm for the single machine total weighted tardiness scheduling problem, which is a strong NP-hard problem. The developmental focus has been on techniques to speed up execution in order to solve large-size problems. This genetic algorithm uses the natural permutation representation of a chromosome for encoding simplicity. Heuristic dispatching rules combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2005
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2003.08.061